Mixing Times in Quantum Walks on Two-Dimensional Grids
نویسندگان
چکیده
Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact expression for the stationary distribution of the coherent walk over odd-sided lattices is obtained after solving the eigenproblem for the evolution operator for this particular graph. The limiting distribution and mixing time of a quantum walk with a coin operator modified as in the abstract search algorithm are obtained numerically. On the basis of these results, the relation between the mixing time of the modified walk and the running time of the corresponding abstract search algorithm is discussed.
منابع مشابه
Quantum Walks on the Hypercube
Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the n-dimensional hypercube, one in discrete time and one in continuous time. In both cases we show that the quantum walk mixes in (π/4)n steps, faster than the Θ...
متن کاملOptimal computation with non-unitary quantum walks
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times respectively. Non-unitary quantum walks can provide a useful optimisation of these properties, producing a more uniform distribution on the line, and faster mixing times on the cycle. We investigate the interplay between quantum and random...
متن کاملYqis 2015
Quantum walks on graphs [? ] are an extension of random walks to the quantum domain. Towards mixing, they can seemingly provide a quadratic speedup compared to reversible classical random walks. On the other hand, lifted randomwalks, as proposed by Diaconis et al. [? ], are a non-quantum extension proven to deliver the same speedup [? ]). However, the construction of lifted walks makes explicit...
متن کاملMixing and decoherence in continuous-time quantum walks on cycles
We prove analytical results showing that decoherence can be useful for mixing time in a continuous-time quantum walk on finite cycles. This complements the numerical observations by Kendon and Tregenna (Physical Review A 67 (2003), 042315) of a similar phenomenon for discrete-time quantum walks. Our analytical treatment of continuous-time quantum walks includes a continuous monitoring of all ve...
متن کاملMixing in Continuous Quantum Walks on Graphs
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1006.4625 شماره
صفحات -
تاریخ انتشار 2010